Supporting Ruled Polygons
نویسندگان
چکیده
We explore several problems related to ruled polygons. Given a ruling of a polygon P , we consider the Reeb graph of P induced by the ruling. We define the Reeb complexity of P , which roughly equates to the minimum number of points necessary to support P . We give asymptotically tight bounds on the Reeb complexity that are also tight up to a small additive constant. When restricted to the set of parallel rulings, we show that the Reeb complexity can be computed in polynomial time.
منابع مشابه
Approximation of ruled and canal surfaces by means of subdivision
Subdivision schemes were originally defined for data in affine spaces and their applications were thus restricted to polygons and polyhedra. Nowadays subdivision schemes for data in arbitrary manifolds are available and the convergence and smoothness behaviour is studied. This opens a wide field of applications and makes it posible to apply suitably modified known refinement schemes to sets of ...
متن کاملConstant-Time Convexity Problems on Reconfigurable Meshes
The purpose of this paper is to demonstrate that the versatility of the reconngurable mesh can be exploited to devise constant-time algorithms for a number of important computational tasks relevant to robotics, computer graphics, image processing, and computer vision. In all our algorithms, we assume that one or two n-vertex (convex) polygons are pretiled, one vertex per processor, onto a recon...
متن کاملCharacterizations of Slant Ruled Surfaces in the Euclidean 3-space
In this study, we give the relationships between the conical curvatures of ruled surfaces generated by the unit vectors of the ruling, central normal and central tangent of a ruled surface in the Euclidean 3-space E^3. We obtain differential equations characterizing slant ruled surfaces and if the reference ruled surface is a slant ruled surface, we give the conditions for the surfaces generate...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کامل